Weighted sum of completion times
نویسندگان
چکیده
4. Weighted sum of completion times 1 Eugene L. Lawler, Maurice Queyranne, Andreas S. Schulz, David B. Shmoys 4.1. Smith’s ratio rule 2 4.2. Preference orders on jobs 5 4.3. Preference orders on sequences and series-parallel precedence constraints 8 4.4. NP-hardness of further constrained min-sum problems 14 4.5. The ratio rule via linear programming 18 4.6. Approximation algorithms for 1|prec|∑w jC j 20 4.7. Sidney Decompositions 24 4.8. An integrality theorem for series-parallel precedence constraints 27 4.9. Approximation algorithms for 1|r j|∑C j 29 4.10. Mean busy times revisited & approximation algorithms for 1|r j|∑w jC j 36
منابع مشابه
A Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملThe Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weighted sum of job completion times (with respect to different job weights). This problem is NP-hard, and we provide a polynomial time approximation scheme for this problem. Our method is based on Lagrangian relaxation mix...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملSequencing to Minimize the Total Weighted Completion Times Subject to Resources and Arbitrary Precedence
We present an anlgorithm for minimizing the sum of the weighted completion times of n jobs that are subject to arbitrary precedence, when each job may require the simultaneous occupancy of a subset of m resources.
متن کاملCoordination Mechanisms for Weighted Sum of Completion
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling. In short, we present the first constant-factor-approximate coordination mechanisms for this model. First...
متن کامل